Embedding Pyramids into 3D Meshes

نویسندگان

  • Cindy K. Y. Ng
  • Lawrence K. L. Pun
  • Dixon Man-Ching Ip
  • Mounir Hamdi
  • Ishfaq Ahmad
چکیده

cessing and image understanding [11, 13]. The most efficient applications of the pyramid are in the areas of scalespace (or multiresolution) and coarse-to-fine operations. Multiscale or multiresolution image representation is a very powerful tool for analyzing numerous image features at multiple scales [6, 11]. Moreover, pyramid machines are not limited just to image processing tasks. By exploiting the hierarchy inherent in the tree structure of a pyramid, and the parallelism inherent at each level, pyramids can handle various problems in graph theory [9], digital geometry [9], and recursive parallel tasks [5]. The 2D mesh architecture, on the other hand, has had wide availability in the research and commercial community. A natural extension of the 2D mesh is the 3D mesh, which has recently gained marked popularity due to a number of inherent architectural features. These include simple VLSI layout, good scalability, higher bandwidth, and smaller diameter compared to 2D mesh (when they have same link width). In addition, since it has three dimensions, it is capable of modeling many physical world problems more naturally, such as 3D image processing and finite element methods. The advantages and rich topological characteristics of 3D mesh have led to the development of the massively parallel MIT J-Machine [3] and, more recently, the CRAY T3D. With the increasing popularity of the 3D mesh and its potential availability coupled with the suitability of many image processing and computer vision applications on a pyramid, we consider the problem of embedding pyramids into 3D meshes. The rest of the paper is organized as follows. Section 2 presents basic terminology and notations and discusses the measures used for our embedding of the pyramid into 3D mesh. Section 3 presents a simple embedding scheme denoted as natural embedding. Section 4 gives an improved embedding scheme denoted as multiple embedding. Section 5 provides some conclusions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes

Embeddings of several graph classes into hypercubes have been widely studied. Unfortunately, almost all investigated graph classes are regular graphs such as meshes, complete trees, pyramids. In this paper, we present a general method for one-to-one embedding irregular graphs into their optimal hypercubes based on extended-edge-bisectors of graphs. An extended-edge-bisector is an edge-bisector ...

متن کامل

How to Subdivide Pyramids, Prisms, and Hexahedra into Tetrahedra

This paper discusses the problem of subdividing meshes containing tetrahedra, pyramids, prisms or hexahedra into a consistent set of tetrahedra. This problem occurs in computer graphics where meshes with pyramids, prisms or hexahedra must be subdivided into tetrahedra to use efficient algorithms for volume rendering, iso-contouring and particle advection. Another application is for the use of s...

متن کامل

Higher-order Finite Elements for Hybrid Meshes Using New Nodal Pyramidal Elements

We provide a comprehensive study of arbitrarily high-order finite elements defined on pyramids. We propose a new family of high-order nodal pyramidal finite element which can be used in hybrid meshes which include hexahedra, tetrahedra, wedges and pyramids. Finite elements matrices can be evaluated through approximate integration, and we show that the order of convergence of the method is conse...

متن کامل

Watermarking 3D models using spectral mesh compression

We propose a robust and imperceptible spectral watermarking method for high rate embedding of a watermark into 3D polygonal meshes. Our approach consists of four main steps: (1) the mesh is partitioned into smaller submeshes, and then the watermark embedding and extraction algorithms are applied to each sub-mesh, (2) the mesh Laplacian spectral compression is applied to the sub-meshes, (3) the ...

متن کامل

Generating Hexahedron-Dominant Mesh Based on Shrinking-Mapping Method

Weidong Min Abstract. This paper presents an algorithm based on shrunken polyhedron and mapping to mesh a convex polyhedron using mixed elements, with mostly hexahedra, but including some tetrahedra, pyramids, and wedges. It is part of a scheme for automatically meshing an arbitrary 3D geometry. The scheme rst decomposes a 3D geometry into a set of convex polyhedra. Then the boundary quadrilate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Parallel Distrib. Comput.

دوره 36  شماره 

صفحات  -

تاریخ انتشار 1996